Recolouring weakly chordal graphs and the complement of triangle-free graphs

For a graph G, the k-recolouring Rk(G) is whose vertices are k-colourings of G and two colourings joined by an edge if they differ in colour on exactly one vertex. We prove that for all n≥1, there exists k-colourable weakly chordal where Rk+n(G) disconnected, answering open question Feghali Fiala. also show every 3K1-free Rk+1(G) connected with diameter at most 4|V(G)|.